Pure Computable Model Theory
نویسندگان
چکیده
2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Introduction History Notation and basic definitions Decidable theories, and computable and decidable models Effective completeness theorem Model completeness and decidability Omitting types and decidability Decidable prime models Computable saturated models and computably saturated models Decidable homogeneous models Vaught's theorem computably visited Decidable Ehrenfeucht theories Decidable theories with countably many countable models Indiscernibles and decidability Degrees of models Automorphisms and computable models Acknowledgments References
منابع مشابه
Effectiveness in RPL, with Applications to Continuous Logic
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of Lukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncount...
متن کاملOrder-Computable Sets
We give a straightforward computable-model-theoretic definition of a property of ∆2 sets, called order-computability. We then prove various results about these sets which suggest that, simple though the definition is, the property defies any characterization in pure computability theory. The most striking example is the construction of two computably isomorphic c.e. sets, one of which is order-...
متن کاملComputable Model Theory
Computability theory formalizes the intuitive concepts of computation and information content. Pure computability studies these notions and how they relate to definability in arithmetic and set theory. Applied computability examines other areas of mathematics through the lens of effective processes. Tools from computability can be used to give precise definitions of concepts such as randomness....
متن کاملModel-theoretic complexity of automatic structures
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic wellfounded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded r...
متن کامل